package fun.coding.search;

public interface BinarySearch {
   
    int findMinimumShiftedArray(int[] a, int left, int right);
   
    int binarySearchShiftedMin(int[] a, int left, int right);
    
    int binarySearch(int[] array, int n, int left, int right);
    
    int binarySearchFirstAppearance(int[] array, int n, int left, int right);
    
    int binarySearchShifted(int[] array, int n, int left, int right);
    
    int countOccurance(int[] array, int number);
    
}
